10,839 research outputs found

    Footprinting of DNA-binding proteins in intact cells

    Get PDF

    Heat and mass transfer in soils, Part I --- Thermal capacitance measurements.

    Get PDF

    Simulating broken PT\cal PT-symmetric Hamiltonian systems by weak measurement

    Full text link
    By embedding a PT\cal PT-symmetric (pseudo-Hermitian) system into a large Hermitian one, we disclose the relations between PT\cal{PT}-symmetric Hamiltonians and weak measurement theory. We show that the amplification effect in weak measurement on a conventional quantum system can be used to effectively simulate a local broken PT\cal PT-symmetric Hamiltonian system, with the pre-selected state in the PT\cal PT-symmetric Hamiltonian system and its post-selected state resident in the dilated Hamiltonian system.Comment: 4 pages; with Supplemental Materia

    Life extending control for rocket engines

    Get PDF
    The concept of life extending control is defined. A brief discussion of current fatigue life prediction methods is given and the need for an alternative life prediction model based on a continuous functional relationship is established. Two approaches to life extending control are considered: (1) the implicit approach which uses cyclic fatigue life prediction as a basis for control design; and (2) the continuous life prediction approach which requires a continuous damage law. Progress on an initial formulation of a continuous (in time) fatigue model is presented. Finally, nonlinear programming is used to develop initial results for life extension for a simplified rocket engine (model)

    Knapsack Model and Algorithm for Hardware/Software Partitioning Problem

    Get PDF
    Efficient hardware/software partitioning is crucial towards realizing optimal solutions for constraint driven embedded systems. The size of the total solution space is typically quite large for this problem. In this paper, we show that the knapsack model could be employed for the rapid identification of hardware components that provide for time efficient implementations. In particular, we propose a method to split the problem into standard 0-1 knapsack problems in order to leverage on the classical approaches. The proposed method relies on the tight lower and upper bounds for each of these knapsack problems for the rapid elimination of the sub-problems, which are guaranteed not to give optimal results. Experimental results show that, for problem sizes ranging from 30 to 3000, the optimal solution of the whole problem can be obtained by solving only 1 sub-problem except for one case where it required the solution of 3 sub-problems
    corecore